Further asymptotic size Ramsey results obtained via linear programming

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Size Ramsey Results for Bipartite Graphs

We show that limn→∞ r̂(F1,n, . . . , Fq,n, Fp+1, . . . , Fr)/n exists, where the bipartite graphs Fq+1, . . . , Fr do not depend on n while, for 1 ≤ i ≤ q, Fi,n is obtained from some bipartite graph Fi with parts V1 ∪ V2 = V (Fi) by duplicating each vertex v ∈ V2 (cv + o(1))n times for some real cv > 0. In fact, the limit is the minimum of a certain mixed integer program. Using the Farkas Lemma ...

متن کامل

A note on Ramsey size-linear graphs

We show that if G is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every cycle in G contains at least four consecutive vertices of degree 2 then G is Ramsey size-linear. ß 2002 John Wiley & Sons, Inc. J Graph Theory 39: 1–5, 2002

متن کامل

Linear Programming in Some Ramsey Problems

We derive new upper bounds for the classical two-color Ramsey numbers R (4,5) 27, R (5,5) 52 and R (4,6) 43; the previous best upper bounds known for these numbers were 28, 53 and 44, respectively. The new bounds are obtained by solving large integer linear programs and with the help of other computer algorithms.

متن کامل

Size Ramsey results for paths versus stars

A general upper bound for the size Ramsey number f(Ps , KI,t) matching the exact value for s ::; 7 and t sufficiently large is presented. Moreover, the remaining unknown values of the size Ramsey number for pairs of forests of order at most five are determined.

متن کامل

Ramsey Stochastic Model via Multistage Stochastic Programming

Ramsey model belongs to “classical” economic dynamic models. It has been (1928) originally constructed (with a farmer’s interpretation) in a deterministic discrete setting. To solve it Lagrangean or dynamic programming techniques can be employed. Later, this model has been generalized to a stochastic version. Time horizon in the original deterministic model as well as in modified stochastic one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2003

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(03)00237-1